class testSort:
    def quick_sort(self, arr, left, right, list2):  #使用的是，算法中的快速排序
        if left > right:
            return
        l = left
        r = right
        x = arr[left]
        x2 = list2[left]
        while l != r:
            while arr[r] <= x and l < r:
                r -= 1
            while arr[l] >= x and l < r:
                l += 1
            t1 = arr[l]
            t2 = list2[l]
            arr[l] = arr[r]
            list2[l] = list2[r]
            arr[r] = t1
            list2[r] = t2
        arr[left] = arr[l]
        list2[left] = list2[l]
        arr[l] = x
        list2[l] = x2
        self.quick_sort(arr, left, l - 1, list2)
        self.quick_sort(arr, r + 1, right, list2)